factor: Optimize factor command with advanced factorization algorithms#9587
factor: Optimize factor command with advanced factorization algorithms#9587naoNao89 wants to merge 1 commit intouutils:mainfrom
Conversation
561e1cf to
3673060
Compare
|
Can this close #1456 ? |
|
GNU testsuite comparison: |
|
Wow, this looks awesome to see a highly optimized version of the factor command. I won't have time to look at it today (most likely tomorrow afternoon), but this is good stuff right here |
3673060 to
78e5601
Compare
|
GNU testsuite comparison: |
78e5601 to
e92a74c
Compare
|
GNU testsuite comparison: |
e92a74c to
e4125bf
Compare
|
cool a few things:
|
e4125bf to
52d1aa4
Compare
CodSpeed Performance ReportMerging #9587 will not alter performanceComparing Summary
Benchmarks breakdown
Footnotes
|
|
GNU testsuite comparison: |
f2e738b to
2ae7cdd
Compare
|
GNU testsuite comparison: |
2ae7cdd to
57ca461
Compare
|
GNU testsuite comparison: |
baeabd8 to
7884538
Compare
|
GNU testsuite comparison: |
7884538 to
cffa831
Compare
cffa831 to
7c62885
Compare
|
GNU testsuite comparison: |
|
GNU testsuite comparison: |
69e10cf to
21a1ae4
Compare
55b9f46 to
b2c4afa
Compare
|
GNU testsuite comparison: |
a46baa4 to
3085bac
Compare
|
GNU testsuite comparison: |
5b70e0a to
fe6b0e5
Compare
|
GNU testsuite comparison: |
|
next phase for 400bit |
7a5f4fd to
f4aa430
Compare
Implement modular factorization architecture with Pollard-Rho, ECM, and Fermat algorithms. Adds Montgomery arithmetic optimization and u64 fast-path for improved u128 performance. Dynamic algorithm selection based on input size routes through unified entry point.
Fixes #1456
All inputs processed in ~35-36ms consistently